Probabilistic implementation of universal quantum processors
نویسندگان
چکیده
منابع مشابه
Universal Hybrid Quantum Processors
A quantum processor (the programmable gate array) is a quantum network with a ˇxed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond to ®loaded ̄ programs without any changing or ®tuning ̄ of network itself. Due to such property and undesirability of entanglement between program and data regi...
متن کاملEfficient Synthesis of Universal Probabilistic Quantum Circuits†
Techniques to efficiently compile higher-level quantum algorithms into lower-level fault-tolerant circuits are needed for the implementation of a scalable, general purpose quantum computer. Several universal gate sets arise from augmenting the set of Clifford gates by additional gates that arise naturally from the underlying fault-tolerance scheme. Examples are the Clifford+T basis which arises...
متن کاملImplementation of quantum maps by programmable quantum processors
The coherent control of individual quantum systems is one of the most exciting achievements in physics in the last decade [1]. The possibility of controlling quantum dynamics has far reaching consequences for quantum technologies, in particular, for quantum computing [2]. One of the best known applications of coherent control in quantum physics is the state preparation of an individual quantum ...
متن کاملSingle-step implementation of universal quantum gates.
We construct optimized implementations of the controlled-NOT and other universal two-qubit gates that, unlike many of the previously proposed protocols, are carried out in a single step. The new protocols require tunable interqubit couplings but, in return, show a significant improvement in the quality of gate operations. We make specific predictions for coupled Josephson junction qubits and co...
متن کاملSmall Universal Networks of Evolutionary Processors
In this article we consider universal networks of evolutionary processors (NEP) having a small number of rules. We show that it is possible to construct a universal NEP with 5 rules when no input/output encoding is used, and a universal NEP with 4 rules in the case in which such an encoding is allowed. We also give a construction of a universal NEP with 7 rules that efficiently (in polynomial t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2002
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.65.022301